Structural parameterizations of Tracking Paths problem

Given a graph G with source and destination vertices s , t ? V ( ) respectively, Tracking Paths asks for minimum set of T ? such that the sequence restricted to encountered in each simple path from is unique. The problem was proven NP -hard [3] found admit quadratic kernel when parameterized by size desired solution [8] . Following recent trends, first time, we study respect structural parameters input graph, measure how far is, an easy instance. We prove admits fixed-parameter tractable FPT algorithms following parameters: i 2-dominating set, ii cluster vertex deletion iii split set. En route also look at Vertex Cover edge clique cover show it tractable. •